A Known Plaintext Attack on Two-Key Triple Encryption
نویسندگان
چکیده
A chosen-plaintext attack on two-key triple encryption noted by Merkle and Hellman is extended to a known-plaintext attack. The known-plaintext attack has lower memory requirements than the chosen-plaintext attack, but has a greater running time. The new attack is a significant improvement over a known-plaintext brute-force attack, but is still not seen as a serious threat to two-key triple encryption.
منابع مشابه
Applying Quantum Search to a Known-Plaintext Attack on Two-Key Triple Encryption
The process of disguising a plaintext into ciphertext is called encryption and back into plaintext is called decryption. A cryptographic algorithm, is also called a cipher, is the mathematical function used for encryption and decryption. Many algorithms are available for this purpose. Triple DES is such an algorithm. Encryption using triple DES is possible in two different ways; they are triple...
متن کاملTight Security Bounds for Triple Encryption
In this paper, we revisit the long-standing open problem asking the exact provable security of triple encryption in the ideal cipher model. For a blockcipher with key length κ and block size n, triple encryption is known to be provably secure up to 2 1 2 min{κ,n} queries, while the best attack requires 2κ+min{κ, n 2 } query complexity. So there has been a gap between the upper and lower bounds ...
متن کاملKey Privacy for Identity Based Encryption
We define key privacy for IBE systems in terms of two properties, indistinguishability under chosen identity attack, and indistinguishability under chosen key generator attack. Further, we show that the BasicIdent system in the Boneh/Franklin IBE has these properties under chosen plaintext attack.
متن کاملOn the Security of an MPEG-Video Encryption Scheme Based on Secret Huffman Tables
This paper studies the security of a recentlyproposed MPEG-video encryption scheme based on secret Huffman tables. Our cryptanalysis shows that: 1) the key space of the encryption scheme is not sufficiently large against divide-and-conquer (DAC) attack and known-plaintext attack; 2) it is possible to decrypt a cipher-video with a partiallyknown key, thus dramatically reducing the complexity of ...
متن کاملCryptanalysis of an MPEG-Video Encryption Scheme Based on Secret Huffman Tables
This paper studies the security of a recentlyproposed MPEG-video encryption scheme based on secret Huffman tables. Our cryptanalysis shows that: 1) the key space of the encryption scheme is not sufficiently large against divide-and-conquer (DAC) attack and known-plaintext attack; 2) it is possible to decrypt a cipher-video with a partiallyknown key, thus dramatically reducing the complexity of ...
متن کامل